Bypassing dangerous sections of the route as a way to improve traffic safety (using St. Petersburg as an example)

A simple routing algorithm to improve vehicle safety on a road network has been proposed. If the is represented by graph with edges and nodes, it enough mark most populated Traffic Accidents (TA) adding attribute of edge some penalty (Dijkstra or Bellman-Ford) will try avoid this automatically. To estimate gain, Relative Risk Ratio RRR= (TAs along route which avoids TA hotspots/TAs original route) was used. Computer simulation performed for St. Petersburg, Russian Federation. It shown that same start end points route, an average RRR gets smaller 14.5–36 % depending length. also cost improving increase in length (by 8–10 %) number nodes 3–12 required.